Distributed Localization Algorithm based on Intersection and Exclusion

نویسندگان

  • Mantian Xiang
  • Chengzhi Long
  • Guicai Yu
چکیده

In this study, we present a novel mobile anchor-assisted node Localization algorithm using Intersection and Exclusion (LIE) for wireless sensor networks. It sets up a discrete network model and then solves a system of geographic constraints based on connectivity information from the underlying communication network. Moreover, after the nearby nodes have completed localization, they become beacons, then cooperate with each other to localize the left unknown nodes in an incremental way and lastly obtains the optimum trajectory of mobile anchors and all the nodes locations. Simulation results demonstrate that the proposed LIE algorithm can improve significantly the localization accuracy compared to other similar positioning technology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

Partial Observation in Distributed Supervisory Control of Discrete-Event Systems

Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...

متن کامل

Using Maekawa’s Algorithm to Perform Distributed Mutual Exclusion in Quorums

In d istributedsystems,cooperatingprocessesshareboth local and remotersources. Chance isveryhighthatmultipleprocessesmakesimultaneous requests to the same resource. If the resourcerequires mutually exclusive access (critical section CS), thensomeregulation isneeded to access it for ensuring synchronizedaccess of the resources thatonly one process could use the resource at a given time. Th is is...

متن کامل

A Fault-Tolerant Algorithm for Decentralized On-line Quorum Adaptation

A quorum-based distributed mutual exclusion protocol requires each processor in a distributed system to obtain permission from a quorum of processors before accessing a resource that cannot be concurrently shared. To prevent failed quorum members from blocking access to the resource, it is desirable to remove failed processors from quorums when failures are detected. This work addresses the pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012